#include"AVLtree.h"
#define N 10000
int main()
{
	hu::AVLtree<int, int>  tree;
	/*vector<int> arr;
	arr.reserve(N);
	srand(time(0));
	for (int i = 0; i < N; i++)
	{
		arr.push_back(rand()%(i+1));
	}*/
	int arr[] = { 0,1,2,3,4,5,6,7,8,9 };
	for (auto e : arr)
	{
		tree.insert(make_pair(e, 1));
		cout << tree.isAVLtree() << endl;
		
	}
	return 0;
}